Iterative methods improving newton's method by the decomposition method

Finding the polar decomposition of a matrix by an efficient iterative method

Theobjective in this paper to study and present a new iterative method possessing high convergence order for calculating the polar decompostion of a matrix. To do this, it is shown that the new scheme is convergent and has high convergence. The analytical results are upheld via numerical simulations and comparisons.

Numerical solution of Klein-Gordon equation by using the Adomian's decomposition and variational iterative methods

An Iterative Domain Decomposition Procedure for the Reduced Basis Method

Reduced basis methods allow efficient model reduction of parametrized partial differential equations. In the current paper, we consider a reduced basis scheme for homogeneous domain decomposition problems. The method is based on iterative Dirichlet-Neumann coupling. We prove convergence of the iterative reduced scheme, derive rigorous a-posteriori error bounds and provide a full offline/online ...

buckling of viscoelastic composite plates using the finite strip method

در سال های اخیر، تقاضای استفاده از تئوری خطی ویسکوالاستیسیته بیشتر شده است. با افزایش استفاده از کامپوزیت های پیشرفته در صنایع هوایی و همچنین استفاده روزافزون از مواد پلیمری، اهمیت روش های دقیق طراحی و تحلیل چنین ساختارهایی بیشتر شده است. این مواد جدید از خودشان رفتارهای مکانیکی ارائه می دهند که با تئوری های الاستیسیته و ویسکوزیته، نمی توان آن ها را توصیف کرد. این مواد، خواص ویسکوالاستیک دارند....

New Iterative Method Based on Laplace Decomposition Algorithm

Since 2001, Laplace decomposition algorithm (LDA) has been one of the reliable mathematical methods for obtaining exact or numerical approximation solutions for a wide range of nonlinear problems. The Laplace decomposition algorithm was developed by Khuri in [2] to solve a class of nonlinear differential equations. The basic idea in Laplace decomposition algorithm, which is a combined form of t...